On average polynomial time
نویسنده
چکیده
One important reason to consider average case complexity is whether all or at least some signi cant part of NP can be solved e ciently on average for all reasonable distributions Let PP comp be the class of problems which are solvable in average polynomial time for every polynomial time computable input distribution Following the framework of Levin the above question can now be formulated as Is NP included in PP comp In this paper it is shown that PP comp contains P as a proper subset Thus even if P NP it is still possible that NP PP comp As a further step it is shown that PP comp is di erent from NP Therefore either NP is not solvable e ciently on average or since PP comp E E NP and hence NP is a proper subset of Exp
منابع مشابه
EFFECT OF LOCATION OF EXPLANATORY VARIABLE ON MONITORING POLYNOMIAL QUALITY PROFILES
The quality is typically modeled as the univariate or multivariate distribution of quality characteristic/s. In recent applications of statistical process control, quality profiles in which the relationship between a response and explanatory variable/s is captured and monitored are increasingly used to model the quality. Several techniques have been developed to enhance the speed of detecting c...
متن کاملAPPLICATION OF EVOLUTIONARY POLYNOMIAL REGRESSION IN ULTRAFILTRATION SYSTEMS CONSIDERING THE EFFECT OF DIFFERENT PARAMETERS ON OILY WASTEWATER TREATMENT
In the present work, the effects of operating conditions including pH, transmembrane pressure, oil concentration, and temperature on fouling resistance and the rejection of turbidity for a polymeric membrane in an ultrafiltration system of wastewater treatment were studied. A new modeling technique called evolutionary polynomial regression (EPR) was investigated. EPR is a method based on regres...
متن کاملMonitoring and Change Point Estimation of AR(1) Autocorrelated Polynomial Profiles
In this paper, a remedial measure is first proposed to eliminate the effect of autocorrelation in phase-ІІ monitoring of autocorrelated polynomial profiles, where there is a first order autoregressive (AR(1)) relation between the error terms in each profile. Then, a control chart based on the generalized linear test (GLT) is proposed to monitor the coefficients of polynomial profiles and an R-c...
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملStructural Average Case Complexity
Levin introduced an average case complexity measure based on a notion of polynomial on average and de ned average case polynomial time many one reducibility among randomized decision problems We generalize his notions of average case complexity classes Random NP and Average P Ben David et al use the notation of hC Fi to denote the set of randomized de cision problems L such that L is a set in C...
متن کامل